Fluid computation of passage-time distributions in large Markov models
نویسندگان
چکیده
Recent developments in the analysis of large Markov models facilitate the fast approximation of transient characteristics of the underlying stochastic process. Fluid analysis makes it possible to consider previously intractable models whose underlying discrete state space grows exponentially as model components are added. In this work, we show how fluid-approximation techniques may be used to extract passage-time measures from performance models. We focus on two types of passage measure: passage times involving individual components, as well as passage times which capture the time taken for a population of components to evolve. Specifically, we show that for models of sufficient scale, global passage-time distributions can be well approximated by a deterministic fluid-derived passage-time measure. Where models are not of sufficient scale, we are able to generate upper and lower approximations for the entire cumulative distribution function of these passage-time random variables, using moment-based techniques. Additionally, we show that, for passage-time measures involving individual components, the cumulative distribution function can be directly approximated by fluid techniques. Finally, using the GPA tool, we take advantage of the rapid fluid computation of passage times to show how a multi-class client–server system can be optimised to satisfy multiple service level agreements.
منابع مشابه
Fluid passage-time calculation in large Markov models
Recent developments in the analysis of large Markov models facilitate the fast approximation of transientcharacteristics of the underlying stochastic process. So-called fluid analysis makes it possible to consider pre-viously intractable models whose underlying discrete state space grows exponentially as model componentsare added. In this work, we show how fluid approximation techni...
متن کاملAggregation and Numerical Techniques for Passage Time Calculations in Large semi-Markov Models
First-passage time densities and quantiles are important metrics in performance analysis. They are used in the analysis of mobile communication systems, web servers, manufacturing systems as well as for the analysis of the quality of service of hospitals and government organisations. In this report we look at computational techniques for the first-passage time analysis on highlevel models that ...
متن کاملDistributed computation of transient state distributions and passage time quantiles in large semi-Markov models
Semi-Markov processes (SMPs) are expressive tools for modelling parallel and distributed systems; they are a generalisation of Markov processes that allow for arbitrarily distributed sojourn times. This paper presents an iterative technique for transient and passage time analysis of large structurally unrestricted semi-Markov processes. Our method is based on the calculation and subsequent nume...
متن کاملDistributed Computation of Passage Time Quantiles and Transient State Distributions in Large Semi-Markov Models
Semi-Markov processes (SMPs) are expressive tools for modelling concurrent systems; they are a generalisation of Markov processes that allow for arbitrarily distributed sojourn times. This paper presents an iterative technique for passage time and transient analysis of large structurally unrestricted semi-Markov processes. Our method is based on the calculation and subsequent numerical inversio...
متن کاملHypergraph-based Parallel Computation of Passage Time Densities in Large Semi-Markov Models
Passage time densities and quantiles are important performance and quality of service metrics, but their numerical derivation is, in general, computationally expensive. We present an iterative algorithm for the calculation of passage time densities in semi-Markov models, along with a theoretical analysis and empirical measurement of its convergence behaviour. In order to implement the algorithm...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Theor. Comput. Sci.
دوره 413 شماره
صفحات -
تاریخ انتشار 2012